polymorphic recursionの例文
- For instance, type inference with polymorphic recursion is known to be undecidable.
- The example given is a solution to the Tower of Hanoi problem wherein a stack simulates polymorphic recursion with a beginning, temporary and ending nested stack substitution structure.
- Functional programming data structures often use polymorphic recursion to simplify type error checks and solve problems with nasty " middle " temporary solutions that devour memory in more traditional data structures such as trees.
